Multi-Dimensional Iterative Reasoning in Action: The Case of the Colonel Blotto Game

نویسندگان

  • Ayala Arad
  • Ariel Rubinstein
چکیده

We introduce a novel decision procedure involving multi-dimensional iterative reasoning, in which a player decides separately on the various features of his strategy using an iterative process. This type of strategic reasoning fits a range of complicated situations in which a player faces a large and non-ordered strategy space. In this paper, the procedure is used to explain the results of a large web-based experiment of a tournament version of the Colonel Blotto Game. The interpretation of the participants’ choices as reflecting multi-dimensional iterative reasoning is supported by an analysis of their response times and the relation between the participants’ behavior in this game and their choices in another game which triggers standard k-level reasoning. Finally, we reveal the most successful strategies in the tournament, which appear to reflect 2-3 levels of reasoning in the two main "dimensions".

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Colonel Blotto’s Top Secret Files

Colonel Blotto “secret files” are opened and Information about the way that people play the game is revealed. The files rely on web-based experiments, which involve a tournament version of the Colonel Blotto Game. A total of 6,500 subjects from two diverse populations participated in the tournaments. The results are analyzed in light of a novel procedure of multi-dimensional iterative reasoning...

متن کامل

Colonel Blotto’s Top Secret Files: Multi-Dimensional Iterative Reasoning in Action

We introduce a novel decision procedure involving multi-dimensional iterative reasoning, in which a player decides separately on the various features of his strategy using an iterative process. This type of strategic reasoning fits a range of complicated situations in which a player faces a large and non-ordered strategy space. In this paper, the procedure is used to explain the results of a la...

متن کامل

Faster and Simpler Algorithm for Optimal Strategies of Blotto Game

In the Colonel Blotto game, which was initially introduced by Borel in 1921, two colonels simultaneously distribute their troops across different battlefields. The winner of each battlefield is determined independently by a winner-take-all rule. The ultimate payoff of each colonel is the number of battlefields he wins. The Colonel Blotto game is commonly used for analyzing a wide range of appli...

متن کامل

The Asymmetric Colonel Blotto Game

This paper explores the Nash equilibria of a variant of the Colonel Blotto game, which we call the Asymmetric Colonel Blotto game. In the Colonel Blotto game, two players simultaneously distribute forces across n battlefields. Within each battlefield, the player that allocates the higher level of force wins. The payoff of the game is the proportion of wins on the individual battlefields. In the...

متن کامل

Discrete Colonel Blotto and General Lotto games

A class of integer-valued allocation games—“General Lotto games”—is introduced and solved. The results are then applied to analyze the classical discrete “Colonel Blotto games”; in particular, optimal strategies are obtained for all symmetric Colonel Blotto games.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012